Combining F-Race and Mesh Adaptive Direct Search for Automatic Algorithm Configuration
نویسندگان
چکیده
In this article, we tackle the automatic algorithm configuration problem (ACP), finding the best configuration of an algorithm such that some measure of its performance is optimized. We study the mesh adaptive direct search (MADS) method for the ACP. MADS is an iterative algorithm for global optimization. It does not require any infomation of the evaluation function, therefore the ACP can be regarded as a black-box for evaluation. To handle the stochastic nature of the ACP, we adopted F-Race, to adaptively allocate the evaluation budgets among a population of candidate configurations. We compare the hybrid of MADS and F-Race (MADS/F-Race) to MADS with certain fixed numbers of evaluations, and demonstrate the advantage and robustness of MADS/F-Race over its counterparts in solving the ACP.
منابع مشابه
MADS/F-Race: Mesh Adaptive Direct Search Meets F-Race
Finding appropriate parameter settings of parameterized algorithms or AI systems is an ubiquitous task in many practical applications. This task is usually tedious and time-consuming. To reduce human intervention, the study of methods for automated algorithm configuration has received increasing attention in recent years. In this article, we study the mesh adaptive direct search (MADS) method f...
متن کاملA mesh generation procedure to simulate bimaterials
It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملDeveloping Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems
Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...
متن کاملF-Race and Iterated F-Race: An Overview
Algorithms for solving hard optimization problems typically have several parameters that need to be set appropriately such that some aspect of performance is optimized. In this chapter, we review F-Race, a racing algorithm for the task of automatic algorithm configuration. F-Race is based on a statistical approach for selecting the best configuration out of a set of candidate configurations und...
متن کامل